LP Bounds for Rate-Distortion With Variable Side Information

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LP Bounds for Rate-Distortion with Variable Side Information

We consider a rate-distortion problem with side information at multiple decoders. Several upper and lower bounds have been proposed for this general problem or special cases of it. We provide an upper bound for general instances of this problem, which takes the form of a linear program, by utilizing random binning and simultaneous decoding techniques [1] and compare it with the existing bounds....

متن کامل

Distortion-rate bounds for fixed- and variable-rate multiresolution source codes

The source coding theorem for stationary sources describes the optimal performance theoretically achievable by fixedand variable-rate block quantizers. The source coding theorem may be generalized by considering the problem of multiresolution or successive refinement source coding, which is the topic of this work. Given a distortion vector (D1; ; DL), this work describes the family of achievabl...

متن کامل

Rate distortion when side information may be absent

-The problem is considered of encoding a discrete memoryless source when correlated side information may or may not be available to the decoder. It is assumed that the side information is not available to the encoder. The rate-distortion function R( D,, D2) is determined where D, is the distortion achieved with side information and D, is the distortion achieved without it. A generalization is m...

متن کامل

Rate-Distortion for Ranking with Incomplete Information

We study the rate-distortion relationship in the set of permutations endowed with the Kendall τ-metric and the Chebyshev metric. Our study is motivated by the application of permutation rate-distortion to the average-case and worst-case analysis of algorithms for ranking with incomplete information and approximate sorting algorithms. For the Kendall τ-metric we provide bounds for small, medium,...

متن کامل

Rate-Distortion Bounds for an Epsilon-Insensitive Distortion Measure

Direct evaluation of the rate-distortion function has rarely been achieved when it is strictly greater than its Shannon lower bound. In this paper, we consider the rate-distortion function for the distortion measure defined by an ε-insensitive loss function. We first present the Shannon lower bound applicable to any source distribution with finite differential entropy. Then, focusing on the Lap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2019

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2019.2922625